Solving a cutting-stock problem with the constraint logic programming language chip

Solving a Cutting-stock Problem with the Constraint Logic Programming Language Chip

CHIP is a new constraint logic programnu ‘ng language combining the declarative aspect of logic progranuni ng with the efficiency of constraint manipulation techniques. In the present paper, we show an application of CHIP to a two-dimensional cutting stock problem. This problem is highly combinatorial and is generally solved by specific programs written in procedural languages. We present two a...

Solving the Two-Stage Cutting Stock Problem

I N T R O D U C T I O N In a number of industries, such as paper and film, there is an important class of problems OVER THE past 20 years, a substantial amount that falls in between the well known one and of work has been done on one and two-dimentwo-dimensional problems. These are referred sional cutting stock problems. A number of to here as two-stage cutting stock problems early authors [1, ...

Solving the Car-Sequencing Problem in Constraint Logic Programming

CHIP is a new constraint logic programming language combining the declarative aspect of logic programming with the efficiency of constraint manipulation techniques. In the present paper, we show an application of CHIP to the car-sequencing problem which occurs in assembly line scheduling in car manufacturing. This problem is highly combinatorial nd has been presented recently as a "challenge" l...

Cutting Planes in Constraint Logic Programming

In this paper, we show how recently developed techniques from combinatorial optimization can be embedded into constraint logic programming. We develop a constraint solver for the constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints. Our approach is based on the generation of polyhedral cutting planes and the concept of branch-and-cut. In the case o...

Solving the General One-Dimensional Cutting Stock Problem with a Cutting Plane Approach